Improving Density-based Clustering using Metric Optimization
نویسندگان
چکیده
منابع مشابه
Improvement of density-based clustering algorithm using modifying the density definitions and input parameter
Clustering is one of the main tasks in data mining, which means grouping similar samples. In general, there is a wide variety of clustering algorithms. One of these categories is density-based clustering. Various algorithms have been proposed for this method; one of the most widely used algorithms called DBSCAN. DBSCAN can identify clusters of different shapes in the dataset and automatically i...
متن کاملClustering Using Normalized Path-Based Metric
In this paper, we propose a normalized path-based metric based on an introduced neighborhood density index which can sufficiently exploit the local density “revealed” by data. The metric axioms (positive definite property, symmetry and triangular inequality) are strictly proved in theory. Using this idea of path, we further devise a heuristic clustering algorithm which can perform the elongated...
متن کاملNew data induced metric for density based clustering
Cluster Analysis is a fundamental data exploration technique in which there exist a variety of algorithms arising in many different areas of the literature. One of the most popular clustering algorithms is fuzzy c-means which minimises the weighted within-group sum of squares functional. However, this algorithm has a major drawback in that it will only find clusters of the same simple convex sh...
متن کاملClustering by density in any metric space
Given a distance matrix on X , establishing partitions (all the elements are clustered in disjoint classes) is generally made optimizing a criterion over the set of all the partitions with a number of classes that must be indicated. In this paper, we investigate a different approach. From the distance matrix, we first build a valued graph Γ = (X,E), for each vertex a density function De is eval...
متن کاملDBCAMM: A novel density based clustering algorithm via using the Mahalanobis metric
In this paper we propose a new density based clustering algorithm via using the Mahalanobis metric. This is motivated by the current state-of-the-art density clustering algorithm DBSCAN and some fuzzy clustering algorithms. There are two novelties for the proposed algorithm: One is to adopt the Mahalanobis metric as distance measurement instead of the Euclidean distance in DBSCAN and the other ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2018
ISSN: 0975-8887
DOI: 10.5120/ijca2018917932